Normally Regular Digraphs, Association Schemes and Related Combinatorial Structures
نویسندگان
چکیده
This paper reports the characteristics of and mutual relationships between various combinatorial structures that give rise to certain imprimitive nonsymmetric three-class association schemes. Nontrivial relation graphs of an imprimitive symmetric 2-class association scheme are m ◦ Kr, (the union of m copies of the complete graph on r vertices) and its complement m ◦Kr, (the complete m-partite strongly regular graph) for some positive integers m and r. The set of nontrivial relation graphs of nonsymmetric three-class fission scheme of such a 2-class association scheme contains a complementary pair of oriented graphs of either m◦Kr or m ◦Kr depending on m and r. For suitable parameters m and r, these graphs arise from various combinatorial objects, such as, doubly regular tournaments, normally regular digraphs, skew Hadamard matrices, Cayley graphs of dicyclic groups and certain group rings. The construction and the characteristics of these objects are investigated combinatorially and algebraically, and their mutual relationships are discussed.
منابع مشابه
Normally Regular Digraphs
A normally regular digraph with parameters (v, k, λ, μ) is a directed graph on v vertices whose adjacency matrix A satisfies the equation AAt = kI + λ(A + At) + μ(J − I − A − At). This means that every vertex has out-degree k, a pair of nonadjacent vertices have μ common out-neighbours, a pair of vertices connected by an edge in one direction have λ common out-neighbours and a pair of vertices ...
متن کاملClassification of Small Class Association Schemes Coming from Certain Combinatorial Objects Table of Contents
We explore twoor three-class association schemes. We study aspects of the structure of the relation graphs in association schemes which are not easily revealed by their parameters and spectra. The purpose is to develop some combinatorial methods to characterize the graphs and classify the association schemes, and also to delve deeply into several specific classification problems. We work with s...
متن کاملClassification of Regular Digraphs, Normally Regular Digraphs, and Strongly Regular Digraphs
We use an exhaustive generation with isomorph-rejection to classify three types of structured digraphs. The first type is the class of regular digraphs where each vertex has the same number of out-neighbors and inneighbors. The second type is the class of normally regular digraphs introduced by Jørgensen. In these digraphs, the number of common out-neighbors (or inneighbors) of vertices x and y...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملSegmented Information Dispersal|A New Design with Application to Erasure Correction
Segmented Information Dispersal (SID) is a new combinatorial design which arises when constructing data organizations that provide erasure correction with certain properties. This paper deenes and studies SID designs. The problem of constructing SID designs is shown to be equivalent to the problem of constructing regular directed graphs with certain properties (collision-free digraphs). The gra...
متن کامل